Broadcast Gossip Algorithms for Consensus
نویسندگان
چکیده
منابع مشابه
Average consensus in sensor networks via broadcast multi-gossip algorithms
Motivated by applications to wireless sensor, peer-to-peer, and ad hoc networks, we propose a distributed algorithm called broadcast based multi-gossiping algorithm (BMGA), which is designed for exchanging information and computing in an arbitrarily connected network of nodes. Unlike traditional randomized gossip algorithms, push-sum mechanism based BMGA preserves the sums and weights, and admi...
متن کاملBroadcast and Gossip Stochastic Average Consensus Algorithms in Directed Topologies
We address the problem of a set of agents reaching consensus by computing the average of their initial states. We propose two randomized algorithms over a directed communication graph where either a random node broadcast its value or a randomly selected pair of nodes communicate in a distributed fashion. The proposed algorithms guarantee convergence in three important definitions, namely: almos...
متن کاملAsymmetric Randomized Gossip Algorithms for Consensus
Distributed averaging is a relevant problem in several application areas, such as decentralized computation, sensor networks, clock synchronization and coordinated control of mobile autonomous agents. Gossip randomized consensus algorithms provide a particular simple and efficient solution of such a problem. These algorithms however need bidirectional communication among agents and this can be ...
متن کاملGossip consensus algorithms via quantized communication
This paper considers the average consensus problem on a network of digital links, and proposes a set of algorithms based on pairwise “gossip” communications and updates. We study the convergence properties of such algorithms with the goal of answering two design questions, arising from the literature: whether the agents should encode their communication by a deterministic or a randomized quanti...
متن کاملConsensus on the Average on Arbitrary Strongly Connected Digraphs Based on Broadcast Gossip Algorithms
In this paper we propose a new decentralized algorithm to solve the consensus on the average problem on arbitrary strongly connected digraphs through a gossip algorithm based on broadcasts. We directly extend previous results by not requiring that the digraph is balanced. Our algorithm is an improvement respect to known gossip algorithms based on broadcasts in that the average of the initial st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2009
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2009.2016247